Maximum likelihood multichannel estimation under reduced rank constraint

نویسندگان

  • Philippe Forster
  • Thierry Asté
چکیده

This paper deals with the maximum likelihood estimation of the multichannel impulse response in a mobile communication system whose base stations are equipped with antennas arrays. The following problem is solved: using the training sequence, find the maximum likelihood multichannel impulse response from one mobile to the base station under a reduced rank constraint in the presence of gaussian noise and jammers with unknown covariance matrix. Our results find applications in equalization (the reduced rank channel estimate can be used in a Viterbi algorithm), and in the estimation of the directions of arrival (DOA) of the paths from the mobile to the base station. In this last application, a MUSIC like algorithm is developped using the estimated channel subspace.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation in Simple Step-Stress Model for the Marshall-Olkin Generalized Exponential Distribution under Type-I Censoring

This paper considers the simple step-stress model from the Marshall-Olkin generalized exponential distribution when there is time constraint on the duration of the experiment. The maximum likelihood equations for estimating the parameters assuming a cumulative exposure model with lifetimes as the distributed Marshall Olkin generalized exponential are derived. The likelihood equations do not lea...

متن کامل

Maximum Likelihood Estimation of the I(2) Model under Linear Restrictions

Estimation of the I(2) cointegrated vector autoregressive (CVAR) model is considered. Without further restrictions, estimation of the I(1) model is by reduced-rank regression (Anderson (1951)). Maximum likelihood estimation of I(2) models, on the other hand, always requires iteration. This paper presents a new triangular representation of the I(2) model. This is the basis for a new estimation p...

متن کامل

Optimal Statistical and Computational Rates for One Bit Matrix Completion

We consider one bit matrix completion under rank constraint. We present an estimator based on rank constrained maximum likelihood estimation, and an e cient greedy algorithm to solve it approximately based on an extension of conditional gradient descent. The output of the proposed algorithm converges at a linear rate to the underlying true low-rank matrix up to the optimal statistical estimatio...

متن کامل

Feature dimension reduction using reduced-rank maximum likelihood estimation for hidden Markov models

This paper presents a new method of feature dimension reduction in hidden Markov modeling (HMM) for speech recognition. The key idea is to apply reduced rank maximum likelihood estimation in the M-step of the usual Baum-Welch algorithm for estimating HMM parameters such that the estimates of the Gaussian distribution parameters are restricted in a sub-space of reduced dimensionality. There are ...

متن کامل

Probabilistic Low-Rank Matrix Completion from Quantized Measurements

We consider the recovery of a low rank real-valued matrix M given a subset of noisy discrete (or quantized) measurements. Such problems arise in several applications such as collaborative filtering, learning and content analytics, and sensor network localization. We consider constrained maximum likelihood estimation of M , under a constraint on the entrywise infinity-norm of M and an exact rank...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998